Interpolation and Almost Interpolation by Weak Chebyshev Spaces

نویسندگان

  • Oleg Davydov
  • Charles K. Chui
چکیده

Some new results on univariate interpolation by weak Cheby-shev spaces, using conditions of Schoenberg-Whitney type and the concept of almost interpolation sets, are given. x1. Introduction Let U denote a nite-dimensional subspace of real-valued functions deened on some set K. We are interested in describing those conngurations T = dimU jT = s: T is called an interpolation set (I-set) w.r.t. U. If s = n, then it is clearly equivalent to the condition that for any given data fy 1 ; : : : ; y n g there exists a unique u 2 U such that It is well known that in the case of univariate polynomial spline spaces all interpolation sets can be characterized by the Schoenberg-Whitney condition (see, e.g., 3, 4]). A new approach to multivariate interpolation has been found by Som-mer and Strauss using the concept of almost interpolation. A set T = t 0 i 2 B i such that T 0 = ft 0 1 ; : : : ; t 0 s g is an I-set w.r.t. U. They have shown that for a wide class of generalized spline spaces deened on polyhedral partitions AI-sets can be characterized by conditions of Schoenberg-Whitney type (for detail see 3]). All rights of reproduction in any form reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpolation by Weak Chebyshev Spaces

We present two characterizations of Lagrange interpolation sets for weak Chebyshev spaces. The rst of them is valid for an arbitrary weak Chebyshev space U and is based on an analysis of the structure of zero sets of functions in U extending Stockenberg's theorem. The second one holds for all weak Chebyshev spaces that possess a locally linearly independent basis. x1. Introduction Let U denote ...

متن کامل

Interpolation on Sparse Gauss-Chebyshev Grids in Higher Dimensions

In this paper, we give a unified approach to error estimates for interpolation on sparse Gauß–Chebyshev grids for multivariate functions from Besov–type spaces with dominating mixed smoothness properties. The error bounds obtained for this method are almost optimal for the considered scale of function spaces. 1991 Mathematics Subject Classification: 41A05, 41A63, 65D05, 46E35

متن کامل

High dimensional polynomial interpolation on sparse grids

We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using ...

متن کامل

Best L1 Approximation and Locally Computed L1 Spline Fits of the Heaviside Function and Multiscale Univariate Datasets

Best L1 approximations of the Heaviside function in Chebyshev and weak-Chebyshev spaces has a Gibbs phenomenon. It has been shown in the nineties for the trigonometric polynomial [1] and polygonal line cases [2]. By mean of recent results of characterization of best L1 approximation in Chebyshev and weak-Chebyshev spaces [3] that we recall, this Gibbs phenomenon can also be evidenced in the pol...

متن کامل

NEW ALGORITHM , S FOR POLYNOMIAL AND TRIGONOMETRIC INTERPOLATION ON PARALLEL COMPUTERS by Ilan Bar -

An interpolation polynomial of order N is constructed from p indepen­ dent subpolynomials of order n '" Nip. Each such subpolynomial is found independently and in parallel. Moreover, evaluation of the polynomial at any given point is done independently and in parallel, except for a final step of summation of p elements. Hence, the algorithm has almost no commu­ ,:.. nication overhead and can be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998